On Repeated Games with Incomplete Information Played by Non - Bayesian Players
نویسنده
چکیده
Unlike in the traditional theory of games of incomplete information, the players here are not Bayesian, i.e. a player does not necessarily have any prior probability distribution as t o what game is being played. The game is infinitely repeated. A player may be absolutely uninformed, i.e. he may know only how many strategies he has. However, after each play the player is informed about his payoff and, moreover, he has perfect recall. A strategy is described, that with probability unity guarantees (in the sense of the liminf of the average payoff) in any game, whatever the player could guarantee if he had complete knowledge of the game.
منابع مشابه
Repeated games with incomplete information and discounting
We analyze discounted repeated games with incomplete information, such that the players’ payoffs depend only on their own type (known-own payoff case). We describe an algorithm for finding all equilibrium payoffs in games for which there exists an open set of belief-free equilibria of Hörner and Lovo (2009). This includes generic games with one-sided incomplete information and a large and impor...
متن کاملThe Robustness of Repeated Game Equilibria to Incomplete Payoff Information
We analyse the role of mixed strategies in repeated (and other dynamic) games where players have private information about past events. History-dependent mixed strategies require a player to play distinct continuation strategies σ and σ′ at information sest ω and ω′ respectively, although the player the player is indifferent between these strategies at both information sets. Such equilibria are...
متن کاملEcon 618 Simultaneous Move Bayesian Games
A game of incomplete information or a Bayesian game is a game in which players do not have full information about each others payoffs. In a strategic situation where a player’s payoff depends on what actions his rivals will take, this poses a problem because a player does not know which game is being played. There are several reasons why players may not have full information about each others’p...
متن کاملRepeated Games with Incomplete Information on One Side: The Case of Different Discount Factors
Two players engage in a repeated game with incomplete information on one side, where the underlying stage-games are zero-sum. In the case where players evaluate their stage-payoffs by using different discount factors, the payoffs of the infinitely repeated game are typically non zero-sum. However, if players grow infinitely patient, then the equilibrium payoffs will sometimes approach the zero-...
متن کاملA Foundation for Markov Equilibria in Infinite Horizon Perfect Information Games
We study perfect information games with an infinite horizon played by an arbitrary number of players. This class of games includes infinitely repeated perfect information games, repeated games with asynchronous moves, games with long and short run players, games with overlapping generations of players, and canonical non-cooperative models of bargaining. We consider two restrictions on equilibri...
متن کامل